Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration
نویسندگان
چکیده
منابع مشابه
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration
We propose a new algorithm for the classical and still practically important problem of approximating the zeros z j of an n-th degree polynomial p(x) within the error bound 2 ?b max j jz j j. The algorithm uses O((n 2 log n) log(bn)) arithmetic operations and comparisons for approximating all the n zeros and O((kn log n) log(bn)) for approximating the k zeros lying in a xed domain (disc or squa...
متن کاملOn Approximating Complex Polynomial Zeros: Modi ed Quadtree (Weyl's) Construction and Improved Newton's Iteration
The known record complexity estimates for approximating polynomial zeros rely on geometric constructions on the complex plane, which achieve initial approximation to the zeros and/or their clusters as well as their isolation from each other, and on the subsequent fast analytic reenement of the initial approximations. We modify Weyl's classical geometric construction for approximating all the n ...
متن کاملOptimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros
K e y w o r d s C o m p l e x polynomial zeros, Approximation, Polynomial factorization, Parallel algorithms, Computational complexity, Sequential algorithms. 1. I N T R O D U C T I O N 1.1. T h e Subject , Some History, and a S u m m a r y of Our Resul ts The problem of solving a polynomial equation p ( x ) = 0 substantially motivated the development of mathematics throughout the centuries. As...
متن کاملPuiseux Series Polynomial Dynamics and Iteration of Complex Cubic Polynomials
We study polynomials with coefficients in a field L as dynamical systems where L is any algebraically closed and complete ultrametric field with dense valuation group and characteristic zero residual field. We give a complete description of the dynamical and parameter space of cubic polynomials. In particular we characterize cubic polynomials with compact Julia sets. Also, we prove that any inf...
متن کاملNew iteration process for approximating fixed points in Banach spaces
The object of this paper is to present a new iteration process. We will show that our process is faster than the known recent iterative schemes. We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings. We also present a numerical example for proving the rate of convergence of our res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2000
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0532